Impact of job dropping on the schedulability of uniprocessor probabilistic real-time systems with variable execution times

نویسندگان

  • Olivier Buffet
  • Liliana Cucu-Grosjean
چکیده

In this paper we address the problem of uniprocessor probabilistic scheduling of real-time systems with variable execution times. For these systems the tasks have an associated probability of missing the deadline, i.e., some jobs may miss their deadlines without affecting the schedulability of the system. Therefore dropping these jobs does not affect the schedulability of the system and it could increase the probability of other jobs to meet their deadline. The problem of deciding what jobs to drop is not trivial and we discuss a possible solution.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Impact of Job Dropping on the Probabilistic Schedulability of Uniprocessor Deterministic Real-time Systems

In [1], the authors point out an interesting open problem concerning the schedulability (with Fixed Priorities) of uniprocessor probabilistic real-time systems with variable execution times: What is the impact of dropping some jobs, in particular when they are doomed to fail? The present paper looks at this problem—i.e., assuming that the scheduling criterion depends on the satisfaction of a su...

متن کامل

A Delay Composition Theorem for Real-Time Distributed Directed Acyclic Systems

In this paper, we present a delay composition rule that bounds the worst-case end-to-end delay of a job as a function of per-stage execution times of higher priority jobs along its path, in a multistage distributed system where the routes of jobs form a directed acyclic graph. The delay composition rule makes no assumption on scheduling policy (except that jobs are assigned the same priority on...

متن کامل

To appear in Software Tools for Technology Transfer Temporal Isolation in Real-Time Systems The VBS Approach

Temporal isolation in real-time systems allows the execution of software processes isolated from one another in the temporal domain. Intuitively, the execution of a process is temporally isolated if the realtime behavior of the process is independent of the execution of the other concurrently scheduled processes in the system. The article provides a comprehensive discussion of temporal isolatio...

متن کامل

Modeling Clairvoyance and Constraints in Real-Time Scheduling

Scheduling in Real-time systems differs from scheduling in conventional models in two principal ways: (a) Parameter variability, (b) Existence of complex constraints between jobs. Our work focusses on variable execution times. Whereas traditional models assume fixed values for job execution time, we model execution times of jobs through convex sets. The second feature unique to real-time system...

متن کامل

Multi-processor Schedulability Analysis of Preemptive Real-Time Tasks with Variable Execution Times

In this paper, we study schedulability analysis problems for multi-processor real-time systems. Assume a set of real time tasks whose execution times and deadlines are known. We use timed automata to describe the non-deterministic arrival times of tasks. The schedulability problem is to check whether the released task instances can be executed within their given deadlines on a multi-processor p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010